A polynomial time approximation algorithm for the two-commodity splittable flow problem
نویسندگان
چکیده
منابع مشابه
A Polynomial Time Approximation Algorithm for the Two-Commodity Splittable Flow Problem
We consider a generalization of the unsplittable maximum two-commodity flow problem on undirected graphs where each commodity i ∈ {1,2} can be split into a bounded number ki of equally-sized chunks that can be routed on different paths. We show that in contrast to the single-commodity case this problem is NP-hard, and hard to approximate to within a factor of α > 1/2. We present a polynomial ti...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly intersecting unit disks whose centers are in P . The task is to find a set B of m disks of maximum radius such that no disk in B intersects a disk in B ∪ R, where m is the maximum number of unit disks that can be packed. B...
متن کاملA Polynomial-time Algorithm for the Generalized Independent-flow Problem
We consider a compound problem of the generalized minimum-cost flow problem and the independent-flow problem, which we call the generalized independent-flow problem. The generalized minimumcost flow problem is to find a minimum-cost flow in a capacitated network with gains, where each arc flow is multiplied by a gain factor when going through an arc. On the other hand, the independent-flow prob...
متن کاملComparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem
Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research
سال: 2012
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s00186-012-0402-9